Taxonomy-based object classification

ABSTRACT

Objects, such as documents, are classified according to a taxonomy. The taxonomy includes nodes, corresponding to object classes, arranged in a hierarchy. Class keywords are associated with the nodes. Search strings are formed for the classes by traversing the taxonomic branches and concatenating the keywords associated with the classes. For each object to be classified, a search engine is used to perform searches on the object using the search strings. The searches produce search scores for each search string. Each object is classified by identifying the class(es) corresponding to the highest search score(s) for the object, and classifying the object into the identified class(es).

BACKGROUND

Anyone who has searched for information on the World Wide Web usingsearch sites, such as Google or Yahoo!, is familiar with the process ofsearching for information in at least one of two ways: by providing atextual query to the search engine describing the information sought(e.g., “Siamese cats”), and by browsing through a hierarchical list ofcategories provided by the site. For example, in the latter case onemight select the category “Animals,” followed by “Mammals,” “Felines,”and “Domestic Cats” to arrive at a list of documents about Siamese catsavailable on the World Wide Web.

The hierarchical list of categories provided by a search site is oneexample of a taxonomy. More generally, a taxonomy is a tree structure ofhierarchically ordered categories used to classify objects and/or data.Taxonomies are often used to aid and facilitate the systematic retrievalof relevant information out of large amounts of stored data, as theexample of the Internet search engine demonstrates.

For a taxonomy to be useful for these purposes, the data must first beclassified according to taxonomy by associating each datum (e.g.,document) with one or more nodes in the taxonomy. For example, documentsthat relate to Siamese cats must be tagged in some way as beingassociated with the “Domestic Cats” node in the taxonomy if thetaxonomy-browsing technique described above is to successfully retrieveweb pages relating to Siamese cats.

Classifying data according to a taxonomy is a difficult problem,particularly if a large amount of data mast be classified. Evenclassifying a single document may be tedious, time-consuming, and errorprone due to the need to: (1) analyze the content of the document, (2)identify any relationships between the document content and the classesdefined by nodes in the taxonomy, and (3) identify one or more suchnodes with which to associate the document. In many environments, suchas corporate or academic intranets, it may be necessary or desirable toperform such classification on millions of documents, to re-classifydocuments as they change, and to continually classify new documents asthey are added to the system. It is particularly desirable to performsuch classification as efficiently, reliably, and automatically aspossible.

SUMMARY

Objects, such as documents, are classified according to a taxonomy. Thetaxonomy includes nodes, corresponding to object classes, arranged in ahierarchy. Class keywords are associated with the nodes. Search stringsare formed for the classes by traversing the taxonomic branches andconcatenating the keywords associated with the classes. For each objectto be classified, a search engine is used to perform searches on theobject using the search strings. The searches produce search scores foreach search string. Each object is classified by identifying theclass(es) corresponding to the highest search score(s) for the object,and classifying the object into the identified class(es).

For example, in one embodiment of the present invention, acomputer-implemented method is provided for classifying an object in ataxonomy. The taxonomy includes a plurality of nodes associated with aplurality of classes. The method includes: (A) identifying a pluralityof search strings based on a plurality of class keywords associated withthe plurality of nodes; (B) using a search engine to perform a pluralityof searches on the object using the plurality of search strings toproduce a plurality of search scores corresponding to the plurality ofsearch strings; (C) identifying one of the plurality of nodes based onthe plurality of search scores; and (D) classifying the object in aclass associated with the identified node.

Another embodiment of the present invention is directed to acomputer-implemented method including: (A) identifying a class in ataxonomy; (B) identifying a plurality of search strings based on aplurality of class keywords associated with the class; (C) using asearch engine to perform a plurality of searches on a plurality ofobjects using the plurality of search strings to produce a plurality ofsearch scores corresponding to the plurality of search strings; (D)identifying a plurality of aggregate search scores corresponding to theplurality of search strings; (E) identifying one of the plurality ofsearch strings having a maximum one of the plurality of aggregate searchscores; (F) identifying one of the plurality of class keywordscorresponding to the identified one of the plurality of search strings;and (G) selecting the identified one of the plurality of class keywordsas a label for the class.

Yet another embodiment of the present invention is directed to acomputer-implemented method including: (A) identifying a first pluralityof documents associated with a user; (B) identifying a plurality ofsearch strings based on a plurality of class keywords associated with aplurality of nodes in a taxonomy, the plurality of nodes beingassociated with a first plurality of classes; (C) identifying a secondplurality of classes, in the taxonomy, associated with the firstplurality of documents by performing a plurality of searches on thefirst plurality of documents using the identified plurality of searchstrings; and (D) associating the second plurality of classes with theuser.

Still a further embodiment of the present invention is directed to acomputer-implemented method including: (A) identifying a first pluralityof classes, in a taxonomy, associated with a first plurality ofdocuments; (B) identifying a second plurality of classes, in thetaxonomy, associated with a user; (C) identifying a subset of the firstplurality of documents based on a comparison between the first pluralityof classes and the second plurality of classes; and (D) associating thesubset of the first plurality of documents with the user.

Another embodiment of the present invention is directed to acomputer-implemented method including: (A) identifying a first pluralityof classes, in a taxonomy, associated with a plurality of documents; (B)modifying a plurality of class keywords associated with a secondplurality of classes in the taxonomy; (C) using a search engine toperform a plurality of searches on the plurality of documents using aplurality of search strings based on the modified plurality of classkeywords to produce a plurality of search scores corresponding to theplurality of search strings; (D) identifying a subset of the modifiedplurality of class keywords based on the plurality of search scores; and(E) modifying the taxonomy in accordance with the identified subset ofthe modified plurality of class keywords.

Still another embodiment of the present invention is directed to acomputer-implemented method including: (A) identifying a plurality ofsearch strings based on a plurality of class keywords associated with aplurality of nodes in a taxonomy, the plurality of nodes correspondingto a plurality of classes, each of the plurality of search stringscorresponding to a distinct one of the plurality of classes; (B) using asearch engine to perform a plurality of searches on a plurality ofdocuments using the plurality of search strings to identify a pluralityof subsets of the plurality of documents, the plurality of subsetscorresponding to the plurality of search strings; and (C) associatingeach of the plurality of subsets of the plurality of documents with theclass corresponding to the search string which resulted in identifyingthe subset.

Other features and advantages of various aspects and embodiments of thepresent invention will become apparent from the following descriptionand from the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1A-1B are diagrams of a taxonomy according to one embodiment ofthe present invention;

FIG. 2 is a diagram of a collection of objects according to oneembodiment of the present invention;

FIG. 3 is a flowchart of a method for classifying objects in a taxonomyaccording to one embodiment of the present invention;

FIG. 4 is a dataflow diagram of a system for performing the method ofFIG. 3 according to one embodiment of the present invention;

FIG. 5 is a flowchart of a method for selecting a class label for aclass in a taxonomy according to one embodiment of the presentinvention;

FIG. 6 is a flowchart of a method for creating a user profile accordingto one embodiment of the present invention;

FIG. 7 is a flowchart of a method for associating documents with a userbased on a profile of the user according to one embodiment of thepresent invention;

FIG. 8 is a flowchart of a method for associating documents with a userbased on a user-specified taxonomy according to one embodiment of thepresent invention;

FIG. 9 is a flowchart of a method for optimizing a taxonomy according toone embodiment of the present invention; and

FIG. 10 is a flowchart of a method for classifying unclassified publicdocuments using a private taxonomy according to one embodiment of thepresent invention.

DETAILED DESCRIPTION

Embodiments of the present invention are directed to techniques forclassifying objects (such as documents) in a taxonomy. Referring toFIGS. 1A-1B, a diagram of an example taxonomy 100 is shown for purposesof illustration. FIG. 1A shows a first view 100 a of the taxonomy 100 inwhich nodes are illustrated as a hierarchy of subsets, while FIG. 1Bshows a second view 100 b of the taxonomy 100 in which nodes areillustrated in a tree structure. Reference numeral 100 will be usedherein to refer to the taxonomy itself, while reference numerals 100 aand 100 b will be used to refer to the particular views shown in FIGS.1A and 1B, respectively. Similarly, reference numerals 102, 104, 106,108, 110, 112, 114, and 116 will be used herein to refer to nodes in thetaxonomy 100, while the same numerals with the suffix “a” or “b” will beused to refer to the views of those nodes in FIG. 1A or 1B,respectively.

A taxonomy may be used to classify a set of objects. The term “object”is used generally herein to refer to anything that may be classified ina taxonomy, such as a physical item, data, or a process. For example, adocument is an example of an “object” as that term is used herein.

Each node in a taxonomy may correspond to a class of objects. Forexample, FIG. 2 is an abstract illustration of a set 200 of objects 202a-f. Assume for purposes of the following discussion that the taxonomy100 shown in FIG. 1 may be used to classify the objects 202 a-fillustrated in FIG. 2. More specifically, each node in the taxonomy 100may correspond to an object class, each of which may contain zero ormore of the objects 202 a-f illustrated in FIG. 2. An object is said tobe “classified” in or by a taxonomy node if the object is a member ofthe class to which the taxonomy node corresponds.

In its simplest form, a taxonomy is a hierarchical structure of a setrepeatedly divided into disjoint subsets. As shown in the view 100 b ofFIG. 1B, this kind of taxonomy may be visualised as an inverted treestructure with nodes (e.g., nodes 102 b, 104 b, 106 b, 108 b, 110 b, 112b, 114 b, and 116 b) and connections (e.g., connections 122 a-g) betweenthem. The single set that contains all objects classified by thetaxonomy is referred to as the “root class” and is represented by theroot node that sits on top of the tree. For example, in the taxonomy 100of FIG. 1, the root class is the class of animals, represented by rootnode 102.

The nodes below the root node 102 correspond to more specificclassifications that apply to subsets of the total set of classifiedobjects corresponding to the root node 102. In general, a node at alower level corresponds to a more specific (narrower) classificationthan an ancestor of that node. For example, node 104 may correspond to aclassification that is more specific than its parent node 102. Theparticular number and organization of nodes in the taxonomy of FIG. 1 isshown merely for purposes of example and does not constitute alimitation of the present invention.

Each subclass in a taxonomy is represented by a node that is directlyconnected to the node corresponding to its superclass. For example, inthe taxonomy of FIG. 1, the subclass of “mammals” is represented by node104, which is directly connected to the node 102 corresponding to itssuperclass (as illustrated by connection 122 a in FIG. 1B).

A class that is no longer divided into subclasses itself is referred toas a “leaf class,” and its corresponding node in the tree is referred toas a “leaf node.” For example, in the taxonomy of FIG. 1, the leaf classof “tigers” is represented by leaf node 114.

Subdividing the root class sequentially into smaller and smallersubclasses may be visualised as traversing the corresponding tree alonga so-called “branch” from the root node to a leaf node along a uniquepath, i.e., a sequence of nodes and connections between them. Consider,for example, subdividing the class of “Animals” into the class of“Mammals,” which is in turn subdivided into the class of “Felines,”which is in turn subdivided into the class of “Domestic cats.” This maybe visualized as traversing the tree 100 b of FIG. 1B from the root node102 b (“animals”) to the leaf node 116 b (“Domestic cats”) along thepath consisting of connection 122 a, node 104 b (“Mammals”), connection122 c, node 108 b (“Felines”), connection 122 f, and node 116 b(“Domestic cats”).

The particular taxonomy 100 illustrated in FIG. 1 is shown merely forpurposes of example. Any other taxonomy may be used in conjunction withembodiments of the present invention.

Thus far each node in the taxonomy 100 has been described as beingassociated with a particular class. The class with which a particularnode is associated may be defined in any of a variety of ways. Forexample, each node in the taxonomy 100 may be associated with one ormore terms, referred to herein as “class keywords,” which serve aslabels to define the class corresponding to the node.

For example, root node 102 may be associated with the class keyword“Animals,” node 104 may be associated with the class keyword “Mammals,”node 106 may be associated with the class keyword “Reptiles,” node 108may be associated with the class keyword “Felines,” node 110 may beassociated with the class keyword “Bovines,” node 112 may be associatedwith the class keyword “Snakes,” node 114 may be associated with theclass keyword “Tigers,” and node 116 may be associated with the classkeyword “Domestic cats.”

Although in the example just provided each node is associated with asingle class keyword, this is not a requirement of the presentinvention. Rather, any node may be associated with any number of classkeywords. For example, a set of equally-valid synonyms may be used asthe keywords for a class. One such keyword for each class may bedesignated as a human-readable label for the class. The keywords for aclass may be selected by, for example, selecting the label for the classand then deriving other keywords from the label. In the followingdiscussion, assume for purposes of example that node 108 is associatedwith the class keywords “felines” and “cats,” where “felines” is theclass label.

Furthermore, a single “keyword” may include one or more words. In otherwords, a class keyword may be a word or a phrase. For example, in FIG. 1the node 116 has the phrase “domestic cats” as a class keyword. The setof class keywords associated with the root node 102 may or may not beempty.

The class keywords for the taxonomy 100 may be selected in any manner.For example, the class keywords may be generated dynamically from theobjects (e.g., objects 202 a-f shown in FIG. 2) associated with thenodes in the taxonomy 100, stored statically, or a combination thereof.The keywords associated with each class may be ordered (i.e., for anygiven pair of keywords associated with a class, one may be preferredover the other) or unordered (i.e., for any given pair of keywordsassociated with a class, neither of the two keywords may be preferredover the other). For example, the keywords “felines” and “cats” for theclass associated with node 108 may be ordered such that “felines” ispreferred over (i.e., has a higher ranking than) “cats.”

As stated above, objects may be classified in a taxonomy. For example,one or more of the objects 202 a-f (FIG. 2) may be classified in thetaxonomy 100 (FIG. 1). In other words, assuming the set 200 of objects202 a-f, each of the nodes in the taxonomy 100 may be associated withzero or more of the objects 202 a-f in the set 200. If a particularobject is associated with a particular node, then the object is said tobe classified in the class associated with the node. Any object in theset 200 may be classified in zero or more classes.

Examples of techniques will now be described for classifying an objectin the taxonomy 100, i.e., for identifying one or more classes toassociate with the object. Referring to FIG. 3, a flowchart is shown ofa method 300 for classifying an object (such as a document) in thetaxonomy 100 according to one embodiment of the present invention.Referring to FIG. 4, a dataflow diagram is shown of a system 400 forperforming the method 300 according to one embodiment of the presentinvention.

The system 402 includes a taxonomy identifier 402, which identifies thetaxonomy 100 into which objects 202 a-f are to be classified (step 302).For example, the system 400 of FIG. 4 includes a set 408 of multipletaxonomies, including the taxonomy 100 of FIG. 1 and two additionaltaxonomies 404 and 406. The taxonomy identifier 402 selects one of thesetaxonomies 408 in which to classify the objects 200.

The taxonomy identifier 402 may perform taxonomy selection in anymanner. For example, a user 428 may provide input 430 to the taxonomyidentifier 402 identifying the taxonomy to be selected. Furthermore,multiple taxonomies may effectively be selected by forming a newtaxonomy having a new root node whose subnodes are the root nodes of themultiple selected taxonomies. For purposes of simplicity, the followingdiscussion will assume that the taxonomy identifier 402 selects taxonomy100 for use in the remainder of the method 300.

A search string identifier 410 identifies a set of search strings 412(i.e., queries) based on the taxonomy 100 selected by the taxonomyidentifier 402 (step 304). The search strings 412 may be selected in anyof a variety of ways, such as the following. The set of search strings412 is initialised to a null set (step 306). For each node N in theselected taxonomy 100 (step 308), two sets of search strings may beconstructed: one by tracing the taxonomic branch from the root node 102to node N (step 310), and one by tracing the taxonomic branch from nodeN to the root node 102 (step 312).

In each of steps 310 and 312, the set of search strings corresponding toa taxonomic branch may be constructed as the set of all possibleconcatenations of class keywords encountered while traversing thebranch, selecting exactly one class keyword at each node along the path.

Consider, for example, the case in which node N is node 116 in thetaxonomy 100. The taxonomic branch from the root node 102 to node 116includes nodes 102, 104, 108, and 116. Tracing the taxonomic branch fromthe root node 102 to node 116 (step 310) produces a first set of twosearch strings: {“animals mammals felines domestic cats”, “animalsmammals cats domestic cats”}. Tracing the taxonomic branch from node 116to the root node 102 (step 312) produces a second set of two searchstrings: {“domestic cats felines mammals animals”, “domestic cats catsmammals animals”}. There are two search strings within each set becausethere are two class keywords (“felines” and “cats”) associated with node108, but exactly one class keyword associated with all other nodes alongthe branch.

Within a search string, the class keywords may be delimited to mark eachof them as an atomic entity. For example, quotation marts may be placedaround each class keyword which consists of multiple words. For example,the search strings above may alternatively be formed as {“animalsmammals felines “domestic cats””, “animals mammals cats “domesticcats””} and {““domestic cats” felines mammals animals”, ““domestic cats”cats mammals animals”}. Such delimitation need not use quotation marks,but instead may be performed in any appropriate manner.

The class keywords may be concatenated within a search string usingappropriate symbols to indicate their logical relations with each other.For example, the first search string indicated above may alternativelybe formed as “animals AND mammals AND felines AND “domestic cats””. Sucha search string may be translated into the syntax required by the searchmechanism (e.g., Internet, search engine) that is used to perform, thesearch described below.

The Boolean AND operator is used here merely as an example; anysymbol(s) representing any logical relations may be used. For example,if the taxonomy 100 specifies particular relations among particularnodes, those particular relations may be used to select the logicaloperators used in the search string. For example, if the taxonomy 100specifies that the relationship between a pair of nodes is a necessaryrelationship, the logical AND operator may be selected to concatenatethe keywords corresponding to the pair of nodes in the search string.

If, however, a node defines a set of alternative classifications, thenthe logical OR operator may be used to concatenate the keywords for thealternatives. For example, consider a taxonomic branch corresponding tothe sequence of keywords “Hydrogen,” “Technologies,” “H2 Storage,”“Organic Hydrides,” and “Napthalin/Decalin,” where the final subclassalternatively contains documents related to Napthalin or Decalin. Inthis case, the two alternative terms within this class label may bejoined by a Boolean OR operator, as in “Napthalin OR Decalin.”

Note that the example just described resulted in two sets of two searchstrings each. The search strings within each set may be ordered orunordered. For example, if the class keywords for a particular class areordered, the search strings may be ordered according to the order of theclass keywords they contain. For example, if the class keywordsassociated with node 108 are ordered in the sequence “felines” followedby “cats”, then the first set of search strings described above may beordered as {“animals mammals felines “domestic cats””, “animals mammalscats “domestic cats””} to reflect the ordering of the class keywordsassociated with node 108.

Once the sets of search strings for node 21 have been selected (steps310-312), those search strings are added to the running list of searchstrings 412 (step 314). Steps 310-314 are repeated for the remainingnodes in the taxonomy 100 (step 316), thereby populating the set ofsearch strings 412 with search strings corresponding to all of the nodesin the taxonomy 100. Each search string in the set of search strings 412may be associated with the node to which it corresponds, so that thecorrespondence may be identified later in the process 300.

Recall that it is desired to classify one or more of the objects 200(FIG. 2) according to the taxonomy 100. As will now be described in moredetail, such classification may be performed by performing searches onthe objects to be classified using one or more of the search strings412.

An object identifier 414 identifies one of the objects 200 to beclassified according to the taxonomy 100 (step 318). For purposes ofexample, in FIG. 4 the object identifier 414 identifies object 202 b.The object identifier 414 may, however, identify any one or more of theobjects 200. If the object identifier 414 identifies more than oneobject, then the steps described below with respect to classification ofobject 202 b may be repeated for the other identified objects.

The object identifier 414 may select the object(s) to be classified inany manner. For example, the user may provide input 432 to the objectidentifier 414 specifying the object(s) to be identified. As anotherexample, the object identifier 414 may identify all of the objects 200.

Consider an example in which the object 202 b to be classified in thetaxonomy 100 is a document. The system 400 includes a search module 416,such as a search engine, which performs one or more searches on theobject 202 b using the search strings 412 (step 320). In other words,for each of the search strings 412 that is selected, the search module416 queries the object 202 b with the search string.

The subset of the search strings 412 to be applied by the search module416 may be selected in any manner. For example, the search module 416may apply all of the search strings 412. In practice, however, using allof the search strings 412 may consume a prohibitive amount ofcomputational resources. As a result, searches may be performed usingfewer than all of the search strings 412. The subset may be selected,for example, either by first using the search string identifier 410 toidentify all possible search strings and then selecting a subset ofthem, or by using the search string identifier 410 to identify only thesubset of ail possible search strings at the outset, in which case thesearch module 416 may apply all of the search strings 412.

As yet another example, rankings may be assigned to the search strings412, and only the most highly-ranked ones of the search strings 412 maybe used to search the object 200. Such rankings may be based, forexample, on the class keywords contained within the search strings.Recall, for example, that node 108 may be associated with the classkeywords “felines” and “cats,” and that the keyword “felines” may bepreferred over (i.e., have a higher value than) “cats”. As a result, asearch string containing the keyword “felines” may be assigned a higherranking than a search string containing the word “cats.” Any formula oralgorithm may be used to assign rankings to the search strings 412.

The most highly-ranked search strings may, for example, be defined as aparticular predetermined number (e.g., ten) of search strings having thehighest rankings or, for example, all search strings having rankingsexceeding some predetermined threshold value.

The search module 416 produces a set of search scores 418 based on thesearches it performs (step 322). Each of the search scores correspondsto one of the search strings applied by the search module 416. Thesearch score for a particular search string represents the relevance ofthe search to the object 202 b. The search score may, for example, be asingle number.

The system 400 includes a search score selector 420 which selects one ormore of the highest search scores 422 (step 324). For example, thesingle highest search score may be selected. The highest score may, forexample, be interpreted (after normalization to unity) as theprobability that the object 202 b (e.g., document) under considerationwould be correctly classified under the class corresponding to thehighest search score.

The system 400 includes an object classifier 424, which identifies oneor more classes 426 into which the object 202 b should be classifiedbased on the selected search score(s) 122 (step 326). Recall that eachof the search strings 412 may be associated with a particular taxonomicbranch, terminating in a particular node (such as a leaf node).Furthermore, each of the selected search scores 422 is associated withthe search string 412 which produced the score. The object classifier424 may therefore identify the object class(es) in which to assign theobject 202 b by identifying the terminal node(s) of the taxonomicbranch(es) associated with the selected (e.g., highest) search score(s)and selecting the class(es) associated with the identified terminalnode(s) as the class(es) in which to classify the object 202 b.Alternatively, for example, the object classifier 424 may associate theobject 202 b with nodes other than terminal nodes in the correspondingtaxonomic branches.

Although in the method 300 just described the object class 426 isselected automatically by the object classifier 414, this is not arequirement of the present invention. Rather, for example, the system400 may present the user 428 with a list of the most likely classes(e.g., the classes corresponding to the selected search score(s) 422).The user 428 may use the presented set of classifications as a startingpoint, select one or more of those classifications as theclassification(s) for the object 202 b, and provide input to the system400 indicating the selected classification(s). The system 400 mayclassify objects more efficiently and accurately than existing systemseven when user input is utilized, because the system 400 may limit thenumber of choices provided to the user 428 to a small number of classeshaving the highest likelihood of being correct.

The classification techniques disclosed herein may be used for a varietyof purposes. For example, as described above, one of the keywords foreach class may be selected as a label for the class. The class label maybe displayed to the user 428 to represent the class. Initially, akeyword may be selected arbitrarily from among all class keywords as alabel for the class. The use of all possible combinations of classkeywords as search strings, however, makes it possible to collectstatistics about which class keyword yields the best average searchscore and therefore is most suitable for use as a class label.

Referring to FIG. 5, a flowchart is shown of a method 500 that may beused to select a class label for a class. A class C in a taxonomy isidentified (step 502). A class keyword, from among a plurality of classkeywords associated with class C, is selected as an initial label forclass C (step 504). A plurality of search strings is selected for classC based on the taxonomic branch of class C, using the techniquesdescribed above with respect to step 304 of FIG. 3 (step 504).

A plurality of objects is identified (step 506). The objects may, forexample, be objects to be classified or already classified by the method300 of FIG. 3, or objects (such as a document corpus) selectedspecifically for use in the class label optimization method 500 of FIG.5. The method 500 performs searches on the identified objects using theidentified search strings as queries, thereby producing search scorescorresponding to the search strings (step 508).

For each search string, the scores corresponding to the search stringare averaged to produce an average score for the search string (step510). More generally, any function may be applied to the search scoresto produce an aggregate search score for each search string. The searchstring having the highest aggregate (e.g., average) search score isidentified (step 512).

The keyword corresponding to class C in the best scoring search stringis identified (step 514). The identified keyword is selected as a newlabel for class C (step 516). Note that although the class labeloptimization method 500 illustrated in FIG. 5 is described herein as astandalone process, the same function may be integrated with otherprocesses, such as the classification process 300 of FIG. 3. As searchscores are obtained for search strings incorporating different classkeywords for a given class, the elements of the method 500 of FIG. 5 maybe applied to those search scores to select more suitable labels for theclass.

Another application of the classification method 300 of FIG. 3 is theautomation creation of user profiles according to an existing taxonomy.For example, referring to FIG. 6, a flowchart is shown of a method 600for creating a user profile according to one embodiment of the presentinvention. A document corpus associated with the user 428 is identified(step 602). The document corpus may, for example, be a document corpuscontaining documents authored by the user 428, read by the user 428,and/or downloaded by the user 428. The classification method 300 of FIG.3 is applied to the document corpus, thereby identifying a set ofclasses associated with the documents in the corpus (step 604). Theclasses that result from the method 300 may be stored and used as aprofile of the user 428 (step 606).

If the document corpus consists of documents authored by the user 428,then the profile may be considered an “expert profile” of the user 428.If the document corpus consists of documents read and/or downloaded bythe user 428, then the profile may be considered a “profile of interest”of the user 428. These are merely examples of ways in which the userprofile may be considered.

Once objects have been classified according to the method 300 of FIG. 3and a user profile has been obtained for the user 428 according to themethod 600 of FIG. 6, documents may be associated with the user 428based on the document classifications and the user profile. For example,referring to FIG. 7, a flowchart is shown of a method 700 forassociating documents with the user 428 according to one embodiment ofthe present invention.

A document corpus is classified using the method 300 of FIG. 3 (step702). A profile of the user 428 is obtained using the method 600 of FIG.6 (step 704). Documents having classifications which sufficiently matchthe user profile are identified (step 706). Any measure of “sufficient”matching may be used. For example, a particular document may be deemedto match the user profile sufficiently if at least some minimum numberof classes associated with the document match classes in the userprofile. Alternatively, for example, some percentage of classes in thedocument classification (e.g., the set of object classes 426 in FIG. 4)and the user profile may be required to match. Any matching documentsmay be associated with the user 428 (step 708). Such documents may, forexample, be sent automatically to the user 428 (e.g., by email) orstored in a user account for subsequent viewing by the user 428.

Documents having matching classifications may be identified in step 706in any of a variety of ways. For example, if documents in the documentcorpus have already been classified according to the taxonomy associatedwith the user profile obtained in step 704, then the classes associatedwith the documents in the document corpus may be compared to the classesassociated with the user profile to determine which documents in thecorpus have classifications that sufficiently match the user profile.If, however, documents in the document corpus have not been classifiedaccording to a taxonomy, or if the documents in the document corpus havenot been classified according to the same taxonomy as the user profile,then matching documents may be identified by performing searches on thedocument corpus using search strings derived from the user profile.Documents which score sufficiently highly in the search results may foeconsidered to match the user profile. In this way, documents in thedocument corpus may be classified within the user profile without theneed to pre-classify the documents under the taxonomy associated withthe user profile.

The method 700 may be performed in various contexts. For example, theuser 428 may select a particular database as the document corpus andthen run the method 700 on the selected corpus to obtain documents ofinterest. As another example, the document corpus may instead be adocument feed, such as an RSS feed, or be linked to an email account (orother type of account) to receive incoming email. The method 700 may beapplied to incoming documents on the feed to identify documents ofpotential interest to the user 428. In other words, the document corpusmay be dynamic, and the classification, matching, and association steps704-708 may be performed as new documents are added to the corpus (e.g.,received on the feed). A corporation or other enterprise may run themethod 700 on a server for a plurality of users, thereby enablingincoming documents to be routed only to those users to whom thedocuments are likely to be of interest.

As an example of yet another application of the classification method300, the user 428 need not be limited to obtaining documents based on aprofile of the user 428. Consider, for example, the method 800 of FIG.8. As in the method 700 of FIG. 7, a document corpus is classifiedaccording to a taxonomy using the method 300 of FIG. 3 (step 802). Inthis case, however, the user 428 specifies a particular taxonomy to beapplied against the document corpus (step 804).

Documents having classifications which sufficiently match theuser-specified taxonomy are identified (step 806), such as in the mannerdescribed above with respect to step 706 of the method 700 of FIG. 7.Any matching documents may be associated with the user 428 (step 808),such as in any of the ways described above with respect to step 708 ofthe method 700 of FIG. 7.

The method 800 of FIG. 8 effectively enables the user 428 to use ataxonomy as a query against a document corpus. Such a method could beparticularly useful, for example, to deliver market intelligence on anongoing basis if combined with a function for alerting the user 428 tonew documents that match the specified taxonomy.

The user 428 may be provided with a convenient user interface forspecifying the search taxonomy in step 804. For example, a comprehensivetaxonomy may be displayed to the user 428 in an expandable/collapsibletree structure. The user 428 may use a graphical user interface (GUI) tonavigate the tree structure and select nodes of interest. The selectednodes, and their interrelationships, may be extracted from thecomprehensive taxonomy to form the user-specified taxonomy in step 806.

Once a document corpus has been classified according to a taxonomy, thetaxonomy may be optimized based on the document corpus. Consider, forexample, the method 900 of FIG. 9. A document corpus is classifiedaccording to a taxonomy using the method 300 of FIG. 3 (step 902).Modifications are made to class keywords associated with nodes of thetaxonomy, such as by adding, deleting, or re-ordering class keywordsassociated with nodes of the taxonomy (step 904). This produces amodified version of the original taxonomy, referred to herein as a“virtual taxonomy.”

The document corpus is classified according to the virtual taxonomy(step 906), thereby producing new search scores which reflect themodifications made to the original taxonomy. The method 900 determineswhether any particular search strings associated with the virtualtaxonomy reliably produced higher search scores than the search stringsassociated with the same nodes in the original taxonomy (step 908). Forany such search strings which are identified, the method 900 modifiesthe original taxonomy based on the nodes in the virtual taxonomy whichcorrespond to the search strings that reliably produced higher searchscores (step 910). For example, if omitting a class keyword from thesearch strings caused reliably higher search scores, then the originaltaxonomy may be modified by deleting the corresponding class from theoriginal taxonomy, the pertaining objects being reclassifiedaccordingly.

Alternatively, for example, the taxonomy structure may remain unchanged,but the keywords in the original taxonomy may be modified based on thesearch strings that reliably produced higher search scores. For example,if omitting a class keyword from the search strings caused reliablyhigher search scores, then the class keyword may be removed from thelist of class keywords for its class.

As yet another alternative, both the taxonomy structure and classkeywords may be optimized by applying both of the techniques justdescribed. As with the other methods disclosed herein, this method 900may be performed as a post-process to an existing document corpus,on-the-fly to a dynamic document corpus as it evolves, or anycombination thereof.

As yet another example of an application of the classification method300, consider the method 1000 of FIG. 10. The method 1000 identifies anexisting taxonomy (step 302). The taxonomy may, for example, be aprivate locally-stored taxonomy developed by the user 428. The method1000 selects search strings based on the taxonomy, such as by using thetechniques disclosed above with respect to step 304 of FIG. 3 (step1004).

The method 1000 provides the search strings as queries to a searchengine to perform searches on unclassified documents (step 1006). Thesearch engine may, for example, be a remotely-located public Internetsearch engine for searching web-based documents.

For each search string, the search results (e.g., web pages or otherweb-based documents) resulting from the search performed using thesearch string may be “virtually” classified in the class correspondingto the search string (step 1008). In this way, the method 1000 providesa way to classify previously-unclassified documents in remoterepositories according to the taxonomy. The method 100 may even be usedto classify documents located in remote repositories according to alocal taxonomy without the need to incorporate the documents into alocal content repository.

Embodiments of the present invention have a variety of advantages. Forexample, embodiments of the present invention enable objects, such asdocuments, to be classified reliably and efficiently based only oninformation contained in the structure of the taxonomy 100. Inparticular, the search strings 412 may be formed solely using classkeywords associated with the taxonomy 100, and without using informationabout relationships among the objects 200 to be classified. As a result,the search module 416 of FIG. 4 may be implemented usingwidely-available, off-the-shelf, inexpensive (or free), efficient, andreliable search engines.

Embodiments of the present invention are also flexible. They may beapplied generally to classify objects 200, such as documents, withoutprior knowledge of the contents, structure, or interrelationships amongthe objects 200. Furthermore, the techniques disclosed herein may beused in conjunction with any taxonomy, so long as the taxonomy isassociated with class keywords in the manner described herein. As aresult, the techniques disclosed herein may be applied effectively to awide variety of taxonomies and objects with little or no customization.

Another advantage of embodiments of the present invention is that theymay be used to classify objects based on a taxonomy even when there isno existing object corpus which has been classified according to thetaxonomy. In other words, the techniques disclosed herein may be used toperform classification based solely on a taxonomy and the objects to beclassified. In comparison to systems which require an existing objectcorpus to be classified according to the taxonomy before additionalobjects may be classified, the techniques disclosed herein providegreater flexibility and reduce the resources required to be expendedbefore classification may be performed. In particular, the techniquesdisclosed herein may perform classification using standard“off-the-shelf” taxonomies, even in the absence of an existing corpus ofcontent on which to base a classification. Because classification isperformed based on the taxonomy, the techniques disclosed herein mayeasily and quickly switch between, and even superimpose, the taxonomiesthat are used for classification.

As described above, the techniques disclosed herein may be used toformulate search strings based on the taxonomic branch connecting a nodeto the root node of the taxonomy. In this way, the hierarchicalstructure of the taxonomic branch corresponding to a particular class islinearized into a form that is suitable for input to a standard searchengine. The techniques disclosed herein, therefore, advantageouslyenable standard search engines to be used to perform searches forhierarchical content, even though such search engines cannot be used tosearch for such content in its original form. The techniques disclosedherein, in other words, may be used to leverage the power and widespreadavailability of search engines to assist in object classification, atask which search engines were not designed to perform.

It is to be understood that although the invention has been describedabove in terms of particular embodiments, the foregoing embodiments areprovided as illustrative only, and do not limit or define the scope ofthe invention. Various other embodiments, including but not limited tothe following, are also within the scope of the claims. For example,elements and components described herein may be further divided intoadditional components or joined together to form fewer components forperforming the same functions.

Although particular examples of taxonomies are disclosed herein,embodiments of the present invention are not limited to use with thosetaxonomies. For example, embodiments of the present invention are notlimited to use in conjunction with the taxonomy 100 of FIG. 1, or totaxonomies having the same or similar data or structure as the taxonomy100 of FIG. 1.

Although in the examples described above the search strings areconstructed by tracing the full taxonomic branch from the root node tonode N and vice versa, this is not a requirement of the presentinvention. For example, if a keyword (e.g., label) for a subclassalready contains a keyword (e.g., label) of a superclass, the samekeyword need not be duplicated within the corresponding search string.For example, if a taxonomic branch has the sequence of keywords“Hydrogen,” “Technologies,” “Storage,” and “Storage Strategy,” then thelabel “Storage” may be omitted from the search string which tests forclassification into the “Storage Strategy” class, since “Storage” isalready contained in “Storage Strategy” and therefore does notcontribute any new information.

As another example, keywords for all nodes in a particular taxonomicbranch need not be included in the search string if the taxonomy is verygeneral and has a large number of levels, while the correspondingobjects (e.g., documents) are very specific in their content. In thiscase, it is unlikely that the taxonomy terms near the root node willappear in the document. In such a case it may be more efficient to startconstructing the search string from the leaf node upwards towards theroot node, yet stopping before the root node itself is reached.

Before performing the method 300, the class keywords for a given classmay be sorted by frequency or popularity of use, such that earlierentries in the list of keywords for the class are more likely to resultin a higher search score than later entries. Assume, for example, thatsome set of objects has already been classified within the taxonomy 100.In that case, the frequency of use of class keywords for a given classmay be identified by, for example, using the search module 416 toperform searches using all possible search strings for the class overthe objects (e.g., documents) already classified within the class, andthen sorting the keywords according to the resulting search scores. Asanother example, the frequency of use of class keywords for a givenclass may be identified by providing ail possible search strings to anInternet search engine and ranking the keywords according to the scoresresulting from such searches.

Although in the examples described above the search module 416 performssearches using ail of the search strings 412, this is not a requirementof the present invention. For example, to increase efficiency, thesearches performed by the search module 416 may be split into multipleruns. For example, in each run only one search string per class may beapplied. In the first run, for example, only the highest-ranking searchstring for each class may be used. If the rankings were generated basedon the average frequency of use of class keywords in the documents, thenthe first run should already produce useful results.

The results of the searches performed by the search module 416 in thefirst run may be evaluated. If the evaluation of the first run indicatesthat its results are sufficiently useful, then the search module 416 mayterminate after the first run. If not, the search module 416 may performa second run using the next most highly-ranked search strings for eachclass, and the results again evaluated for usefulness. This techniquelimits the number of searches that need to be performed to the numbernecessary to produce useful results, and thereby limits thecomputational resources required to be utilized by the search module416.

The term “search engine” as used herein, may refer to any apparatusand/or software that performs searches. The terra “search engine,” asused herein, is not limited to search engines accessible over theInternet or to search engines for searching Web content. The searchmodule 416 may, for example, include or otherwise have access to andmake use of a search engine to perform searches. Those having ordinaryskill in the art will appreciate how to use search engines to performthe functions disclosed herein.

The techniques described above may be implemented, for example, inhardware, software, firmware, or any combination thereof. The techniquesdescribed above may be implemented in one or more computer programsexecuting on a programmable computer including a processor, a storagemedium readable by the processor (including, for example, volatile andnon-volatile memory and/or storage elements), at least one input device,and at least one output device. Program code may be applied to inputentered using the input device to perform the functions described and togenerate output. The output may be provided to one or more outputdevices.

Those having ordinary skill will understand how to implement anycomponent of the system 400 using appropriate program code. For example,any of the data structures of the system 400 may contain data values byincorporation (copying) or by reference (pointers). Therefore, anyreferences herein to a data structure “containing” or “including”particular data should be understood to encompass implementations inwhich the data structure refers to the data.

Each computer program within the scope of the claims below may beimplemented in any programming language, such as machine language,assembly language, a high-level procedural programming language, afunctional programming language, a logic programming language, or anobject-oriented programming language. The programming language may, forexample, be a compiled or interpreted programming language.

Each such computer program may be implemented in a computer programproduct tangibly embodied in a machine-readable storage device forexecution by a computer processor. Method steps of the invention may beperformed by a computer processor executing a program tangibly embodiedon a computer-readable medium to perform functions of the invention byoperating on input and generating output. Suitable processors include,by way of example, both general and special purpose microprocessors.Generally, the processor receives instructions and data from a read-onlymemory and/or a random access memory. Storage devices suitable fortangibly embodying computer program instructions include, for example,ail forms of non-volatile memory, such as semiconductor memory devices,including EPROM, EEPROM, and flash memory devices; magnetic disks suchas internal hard disks and removable disks; magneto-optical disks; andCD-ROMs. Any of the foregoing may be supplemented by, or incorporatedin, specially-designed ASICs (application-specific integrated circuits)or FPGAs (Field-Programmable Gate Arrays). A computer can generally alsoreceive programs and data from a storage medium such as an internal disk(not shown) or a removable disk. These elements will also be found in aconventional desktop or workstation computer as well as other computerssuitable for executing computer programs implementing the methodsdescribed herein, which may be used in conjunction with any digitalprint engine or marking engine, display monitor, or other raster outputdevice capable of producing color or gray scale pixels on paper, film,display screen, or other output medium.

1. A computer-implemented method for classifying an object in ataxonomy, the taxonomy including a plurality of nodes associated with aplurality of classes, the object being external to the taxonomy, themethod comprising: (A) identifying a plurality of search strings basedon a first plurality of class keywords associated with the plurality ofnodes, wherein identifying comprises, for at least one particular node Nin the plurality of nodes: (A)(1) traversing a first branch in thetaxonomy linking a root node of the taxonomy to node N; and (A)(2) foreach node M in the first branch, selecting a class keyword associatedwith node M and adding the selected class keyword to a first one of theplurality of search strings associated with node N, whereby the firstone of the plurality of search strings contains a second plurality ofclass keywords; (B) using a search engine to perform a plurality ofsearches on the object using the plurality of search strings to producea plurality of search scores corresponding to the plurality of searchstrings; (C) identifying one of the plurality of nodes based on theplurality of search scores; and (D) classifying the object in a classassociated with the identified node.
 2. The method of claim 1, wherein(A) further comprises: (A)(3) traversing a second branch in the taxonomylinking node N to the root node of the taxonomy; and (A)(4) for eachnode L in the second branch, selecting a class keyword associated withnode L and adding the selected class keyword to a second one of theplurality of search strings associated with node N.
 3. The method ofclaim 1, wherein (A) further comprises delimiting each of the secondplurality of class keywords in the first one of the plurality of searchstrings to mark each of the second plurality of class keywords in thefirst one of the plurality of search strings as an atomic entity.
 4. Themethod of claim 1, wherein (A) further comprises concatenating thesecond plurality of class keywords in the first one of the plurality ofsearch strings with symbols indicating logical relationships of thesecond plurality of class keywords in the first one of the plurality ofsearch strings to each other.
 5. The method of claim 1, wherein a thirdplurality of class keywords having an order is associated with node M,and wherein (A)(2) comprises selecting the class keyword based on theorder of the third plurality of class keywords associated with node M.6. The method of claim 1, wherein (C) comprises: (C)(1) identifying oneof the plurality of search scores having a maximum value among theplurality of search scores; (C)(2) identifying one of the plurality ofsearch strings that produced the search score having the maximum value;and (C)(3) identifying one of the plurality of nodes associated with aplurality of class keywords on which the identified one of the pluralityof search strings was based.
 7. The method of claim 1, wherein (D)comprises: (D)(1) identifying a class among the plurality of classesassociated with the identified one of the plurality of nodes; and (D)(2)classifying the object in the identified class.
 8. The method of claim1, wherein the object comprises a document.
 9. The method of claim 1,wherein (A) further comprises: (A)(3) identifying a first plurality ofsearch strings based on the first plurality of class keywords associatedwith the plurality of nodes; (A)(4) identifying a plurality of rankingsof the first plurality of search strings; and (A)(5) identifying asubset of the first plurality of search strings based on the pluralityof rankings; and wherein (B) comprises performing the plurality ofsearches on the object using the subset of the first plurality of searchstrings to produce the plurality of search scores.
 10. The method ofclaim 1, wherein (C) comprises: (C)(1) providing a user with anindication of a plurality of nodes corresponding to a subset of theplurality of search scores; and (C)(2) receiving from the user aselection of one of the plurality of nodes corresponding to the subsetof the plurality of search scores.
 11. A computer program productcomprising computer-executable instructions, tangibly stored on acomputer readable medium, for execution by a processor to perform amethod for classifying an object in a taxonomy, the taxonomy including aplurality of nodes associated with a plurality of classes, the objectbeing external to the taxonomy, the method comprising: (A) identifying afirst plurality of search strings based on a plurality of class keywordsassociated with the plurality of nodes, wherein identifying comprises,for at least one particular node N in the plurality of nodes: (A)(1)traversing a first branch in the taxonomy linking a root node of thetaxonomy to node N; and (A)(2) for each node M in the first branch,selecting a class keyword associated with node M and adding the selectedclass keyword to a first one of the plurality of search stringsassociated with node N, whereby the first one of the plurality of searchstrings contains a second plurality of class keywords; (B) performing aplurality of searches on the object using the plurality of searchstrings to produce a plurality of search scores corresponding to theplurality of search strings; (C) identifying one of the plurality ofnodes based on the plurality of search scores; and (D) classifying theobject in a class associated with the identified node.
 12. The computerprogram product of claim 11, wherein (A) further comprises: (A)(3)traversing a branch in the taxonomy linking node N to the root node ofthe taxonomy; and (A)(4) for each node L in the second branch, selectinga class keyword associated with node L and adding the selected classkeyword to a second one of the plurality of search strings associatedwith node N.
 13. The computer program product of claim 11, wherein (A)further comprises delimiting each of the second plurality of classkeywords in the first one of the plurality of search strings to markeach of the second plurality of class keywords in the first one of theplurality of search strings as an atomic entity.
 14. The computerprogram product of claim 11, wherein (A) further comprises concatenatingthe second plurality of class keywords in the first one of the pluralityof search strings with symbols indicating logical relationships of thesecond plurality of class keywords in the first one of the plurality ofsearch strings to each other.
 15. The computer program product of claim11, wherein a third plurality of class keywords having an order isassociated with node M, and wherein (A)(2) comprises selecting the classkeyword based on the order of the third plurality of class keywordsassociated with node M.
 16. The computer program product of claim 11,wherein (C) comprises: (C)(1) identifying one of the plurality of searchscores having a maximum value among the plurality of search scores;(C)(2) identifying one of the plurality of search strings that producedthe search score having the maximum value; and (C)(3) identifying one ofthe plurality of nodes associated with a plurality of class keywords onwhich the identified one of the plurality of search strings was based.17. The computer program product of claim 11, wherein (D) comprises:(D)(1) identifying a class among the plurality of classes associatedwith the identified one of the plurality of nodes; and (D)(2)classifying the object in the identified class.
 18. The computer programproduct of claim 11, wherein the object comprises a document.
 19. Thecomputer program product of claim 11, wherein (A) comprises: (A)(3)identifying a first plurality of search strings based on the pluralityof class keywords associated with the plurality of nodes; (A)(4)identifying a plurality of rankings of the first plurality of searchstrings; and (A)(5) identifying a subset of the first plurality ofsearch strings based on the plurality of rankings; and wherein (B)comprises performing the plurality of searches on the object using thesubset of the first plurality of search strings to produce the pluralityof search scores.
 20. The computer program product of claim 11, wherein(C) comprises: (C)(1) providing a user with an indication of a pluralityof nodes corresponding to a subset of the plurality of search scores;and (C)(2) receiving from the user a selection of one of the pluralityof nodes corresponding to the subset of the plurality of search scores.21. The computer program product of claim 11, wherein (B) comprises asearch engine.